A New Secure Multicast Key Distribution Protocol Using Combinatorial Boolean Approach

In the present paper, we propose a new protocol for a scalable multicast key distribution protocol. The proposed protocol is based on Key Management using Boolean Function Minimization (KM-BFM) technique. It is considered one of the best solutions proposed for solving the scalability of multicast security protocols depending on a centralized manager. Instead of using one tree as in KMBFM, the members are divided into a number of subgroup trees. A comparison between KM-BFM and other centralized protocols is detailed. The comparison shows that KM-BFM protocol has the lowest communication overhead. Furthermore, it has the lowest storage at the security manager. Then, a comparison between the proposed protocol and KM-BFM protocol is given. The comparison shows that the proposed protocol has lower storage requirements. Further, it achieves a lower communication overhead in case of a single member leave and a comparable communication overhead in case of multiple leaves.